github.com/andybalholm/brotli.encoderDictionary.words (field)

15 uses

	github.com/andybalholm/brotli (current package)
		encoder_dict.go#L5: 	words                 *dictionary
		encoder_dict.go#L14: 	dict.words = getDictionary()
		hash.go#L130: 	offset = uint(dictionary.words.offsets_by_length[len]) + len*word_idx
		hash.go#L135: 	matchlen = findMatchLengthWithLimit(data, dictionary.words.data[offset:], uint(len))
		hash.go#L142: 		backward = max_backward + 1 + word_idx + (transform_id << dictionary.words.size_bits_by_length[len])
		static_dict.go#L83: 			var n uint = uint(1) << dict.words.size_bits_by_length[l]
		static_dict.go#L88: 				var matchlen uint = dictMatchLength(dict.words, data, id, l, max_length)
		static_dict.go#L308: 				if !isMatch(dict.words, w, data, max_length) {
		static_dict.go#L436: 			var n uint = uint(1) << dict.words.size_bits_by_length[l]
		static_dict.go#L442: 				if !isMatch(dict.words, w, data[1:], max_length-1) {
		static_dict.go#L508: 				if !isMatch(dict.words, w, data[1:], max_length-1) {
		static_dict.go#L600: 				var n uint = uint(1) << dict.words.size_bits_by_length[l]
		static_dict.go#L604: 				if w.transform == 0 && isMatch(dict.words, w, data[2:], max_length-2) {
		static_dict.go#L632: 				var n uint = uint(1) << dict.words.size_bits_by_length[l]
		static_dict.go#L636: 				if w.transform == 0 && isMatch(dict.words, w, data[5:], max_length-5) {